Section: Software

TreeMatch

Participants : Emmanuel Jeannot, Guillaume Mercier.

• TreeMatch is a library for performing process placement based on the topology of the machine and the communication pattern of the application.

• TreeMatch provides a permutation of the processes to the processors/cores in order to minimize the communication cost of the application.

• Important features are : the number of processors can be higher than the number of processes ; it assumes that the topology is a tree and does not require valuation of the topology (e.g. communication speed) ; it implements different placement algorithms that are switched according to the input size.

• TreeMatch is implemented as a load-balancer in Charm++ and as an tool for performing rank reordering in OpenMPI and MPICH-2 [37]